2D Thinning Algorithms
نویسندگان
چکیده
Publications: Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation [7], Németh, Gábor [8], and Palágyi Kálmán [9] , Progress in Combinatorial Image Analysis, May 2010, Singapore, p.183 194, (2010) An order-independent sequential thinning algorithm [10], Kardos, Péter [11], Németh Gábor [12], and Palágyi Kálmán [9] , Proceedings of the International Workshop on Combinatorial Image Analysis (IWCIA), Nov 2009, Number 5852, Playa del Carmen, Mexico, p.162 175, (2009) 2D Parallel Thinning Algorithms Based on Isthmus-Preservation [13], Németh, Gábor [12], and Palágyi Kálmán [9] , Proceedings of the International Symposium on Image and Signal Processing
منابع مشابه
New 2D Parallel Thinning Algorithms Based on Critical Kernels
Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. In this context, we propose several new parallel algorithms, which are both fast and simple to implement, to obtain symmetrical skeletons of 2D objects in 2D or 3D grids. We prove some properties of these skeletons, related to topology preservation, ...
متن کامل2D Parallel Thinning and Shrinking Based on Sufficient Conditions for Topology Preservation
Thinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient cond...
متن کاملMetrical properties of a collection of 2D parallel thinning algorithms
This paper is dedicated to the study of metrical properties of a collection of 2D thinning algorithms that we have proposed. Here, we characterize their underlying metrics and use it to reduce the classical metrical biases that affect thinning algorithms in the square grid. We show that some algorithms from the collection lead to skeletons based on a particular geometry, corresponding to the (4...
متن کاملNote on fifteen 2D parallel thinning algorithms
We present a study of fifteen parallel thinning algorithms, based on the framework of critical kernels. We prove that ten among these fifteen algorithms indeed guarantee topology preservation, and give counter-examples for the five other ones. We also investigate, for some of these algorithms, the relation between the medial axis and the obtained homotopic skeleton.
متن کاملA Thinning Method of Linear And Planar Array Antennas To Reduce SLL of Radiation Pattern By GWO And ICA Algorithms
In the recent years, the optimization techniques using evolutionary algorithms have been widely used to solve electromagnetic problems. These algorithms use thinning the antenna arrays with the aim of reducing the complexity and thus achieving the optimal solution and decreasing the side lobe level. To obtain the optimal solution, thinning is performed by removing some elements in an array thro...
متن کامل